Search results for "graph products"
showing 1 items of 1 documents
Vertex Distinguishing Edge- and Total-Colorings of Cartesian and other Product Graphs
2012
International audience; This paper studies edge- and total-colorings of graphs in which (all or only adjacent) vertices are distinguished by their sets of colors. We provide bounds for the minimum number of colors needed for such colorings for the Cartesian product of graphs along with exact results for generalized hypercubes. We also present general bounds for the direct, strong and lexicographic products.